Empirically evaluating Greedy-based test suite reduction methods at different levels of test suite complexity
نویسندگان
چکیده
Article history: Received 29 August 2016 Received in revised form 10 May 2017 Accepted 14 May 2017 Available online 24 May 2017
منابع مشابه
Methods and Metrics for Selective Regression Testing
In corrective maintenance, selective regression testing includes test selection from previously run test suite and test coverage identification. We propose three reductionbased regression test selection methods and two coverage McCabe-based identification metrics. We empirically compare these methods with other three reduction and precision-oriented methods using 60 test-problems. The compariso...
متن کاملTest suite reduction methods that decrease regression testing costs by identifying irreplaceable tests
Context: In software development and maintenance, a software system may frequently be updated to meet rapidly changing user requirements. New test cases will be designed to ensure the correctness of new or modified functions, thus gradually increasing the test suite's size. Test suite reduction techniques aim to decrease the cost of regression testing by removing the redundant test cases from t...
متن کاملA Cost-Aware Test Suite Minimization Approach Using TAP Measure and Greedy Search Algorithm
Software testing is required to detect the faults and to ensure the quality of the software under development. Usually, test suites are used to evaluate the software system during the software development cycle. But often test suites contain more redundant test cases due to overlapped test objectives. So, the test-suite reduction is an important step to reduce the number of test cases so as to ...
متن کاملA Degraded ILP Approach for Test Suite Reduction
As the cost of executing and maintaining a large test suite is always expensive, many heuristic techniques have been brought out for test suite reduction in spite of no guarantee of minimum size. The integer linear programming (ILP) approach can generate minimum test suites but it may cost exponential time. This paper proposes a degraded ILP (DILP) approach to bridge the gap between the ILP met...
متن کاملThe density algorithm for pairwise interaction testing
There are many published algorithms for generating interaction test suites for software testing, exemplified by AETG, IPO, TCG, TConfig, simulated annealing and other heuristic search, and combinatorial design techniques. Among these, greedy one-test-at-a-time methods (such as AETG and TCG) have proven to be a reasonable compromise between the needs for small test suites, fast test-suite genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Sci. Comput. Program.
دوره 150 شماره
صفحات -
تاریخ انتشار 2017